#include <iostream>
#include <vector>
#include <unordered_set>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define endl '\n'
const int N = 2010;
vector<int> a[N];
int sg[N];
int n, m, k;

int dfs(int cur)
{
    if(sg[cur] != -1) return sg[cur];
    unordered_set<int> mp;
    for(auto v : a[cur])  mp.insert(dfs(v));
    for(int i = 0; ; i++)
    {
        if(!mp.count(i)) return sg[cur] = i;
    }
}

void solve() 
{
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++) sg[i] = -1;
    for(int i = 1; i <= m; i++)
    {
        int x, y; cin >> x >> y;
        a[x].push_back(y);
    }
    int s = 0;
    for(int i = 1; i <= k; i++)
    {
        int x; cin >> x;
        int ret = dfs(x); // 求该节点的sg值
        s ^= ret;  
    }
    if(s) cout << "win" << endl;
    else cout << "lose" << endl;
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
// 	cin >> T;
	while(T--)
	{
        solve();
	}
	return 0;
}